No . 99 - 429 On the Power of Real { Time Turing Machines : kTapes Are More Powerful than
نویسندگان
چکیده
We show that, for any integer k, there is at least one language which is accepted by a k-tape real{time Turing machine, but cannot be accepted by a (k ? 1)-tape real{time Turing machine. We show therefore that the languages accepted by real{time Turing machines form an innnite hierarchy with respect to the number of tapes used.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملTime-Restricted Sequence Generation
The classes of sequences generated by timeand spacerestricted multiple counter machines are compared to the corresponding classes generated by similarly restricted multiple tape Turing machines. Special emphasis is placed on the class of sequences generable by machines which operate in real time. Real-time Turing machines are shown to be strictly more powerful than real-time counter machines. A...
متن کاملThe Myth of 'the Myth of Hypercomputation'
ness and Approximations Thursday, June 9, 2011 Abstractness and Approximations • This rather absurd attack goes as followsness and Approximations • This rather absurd attack goes as follows Thursday, June 9, 2011 Abstractness and Approximations • This rather absurd attack goes as follows 1. Even Turing machines are abstract models that can’t be implemented fully.ness and Approximations • This r...
متن کاملThe Computational Power of Interactive Recurrent Neural Networks
In classical computation, rational- and real-weighted recurrent neural networks were shown to be respectively equivalent to and strictly more powerful than the standard Turing machine model. Here, we study the computational power of recurrent neural networks in a more biologically oriented computational framework, capturing the aspects of sequential interactivity and persistence of memory. In t...
متن کاملUnbounded-error quantum computation with small space bounds
We prove the following facts about the language recognition power of quantum Turing machines (QTMs) in the unbounded error setting: QTMs are strictly more powerful than probabilistic Turing machines for any common space bound s satisfying s(n) = o(log log n). For " one-way " Turing machines, where the input tape head is not allowed to move left, the above result holds for s(n) = o(log n). We al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999